Unauthorized inferences in semistructured databases q
نویسندگان
چکیده
In this paper we study the problem of providing controlled access to confidential data stored in semistructured databases. More specifically, we focus on privacy violations via data inferences that occur when domain knowledge is combined with nonprivate data. We propose a formal model, called Privacy Information Flow Model, to represent the information flow and the privacy requirements. These privacy requirements are enforced by the Privacy Mediator. Privacy Mediator guarantees that users are not be able to logically entail information that violates the privacy requirements. We present an inference algorithm that is sound and complete. The inference algorithm is developed for a tree-like, semistructured data model, selection–projection queries, and domain knowledge, represented as Horn-clause constraints. 2006 Elsevier Inc. All rights reserved. 0020-0255/$ see front matter 2006 Elsevier Inc. All rights reserved. doi:10.1016/j.ins.2006.01.004 q This work was partially supported by the National Science Foundation under grants IIS-0237782 (Farkas), 9734242 (Brodsky), and CCR-0113515 and IIS-0242237 (Jajodia). * Corresponding author. Tel.: +1 803 576 5762; fax: +1 803 777 3767. E-mail addresses: [email protected] (C. Farkas), [email protected] (A. Brodsky), jajodia@ gmu.edu (S. Jajodia). 3270 C. Farkas et al. / Information Sciences 176 (2006) 3269–3299
منابع مشابه
NF-SS: A Normal Form for Semistructured Schema
Semistructured data is becoming increasingly important for web applications with the development of XML and related technologies. Designing a “good” semistructured database is crucial to prevent data redundancy, inconsistency and undesirable updating anomalies. However, unlike relational databases, there is no normalization theory to facilitate the design of good semistructured databases. In th...
متن کاملDesigning Semistructured Databases Using ORA-SS Model
Semistructured data has become prevalent with the growth of the Internet. The development of new web applications that require efficient design and maintenance of large amounts of data makes it increasingly important to design “good” semistructured databases to prevent data redundancy and updating anomalies. However, it is not easy, even impossible, for current semistructured data models to cap...
متن کاملProximity Determination and its Optimization for Semistructured Data
Proximity queries have been shown to be very useful for semistructured databases in many applications. However, it is challenging to determine proximity even for semistructured database of moderate size. This paper first summarizes our recent proposal for proximity determination of semistructured data. We then present the optimization techniques to scale this proposed methodology to deal with v...
متن کاملDataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural summaries of semistructured databases. DataGuides serve as dynamic schemas, generated from the database; they are useful for browsing database structure, formulating queries, storing information such as statistics and...
متن کاملInstance-Independent View Serializability for Semistructured Databases
Semistructured databases require tailor-made concurrency control mechanisms since traditional solutions for the relational model have been shown to be inadequate. Such mechanisms need to take full advantage of the hierarchical structure of semistructured data, for instance allowing concurrent updates of subtrees of, or even individual elements in, XML documents. We present an approach for concu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006